Distributed University Timetabling with Multiply Sectioned Constraint Networks
نویسندگان
چکیده
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The proposed solution has several distinguishing features: Unlike the existing algorithms for DisCSPs whose worst-case time complexities are exponential, the algorithm suite based on MSCNs is efficient when the network topology is sparse. Unlike the existing DisTTP algorithm where a central agent is needed, there is no need for a central agent in the proposed solution. Unlike the existing DisTTP algorithm where partial timetables of other agents must be disclosed to the central agent, the proposed method keeps partial timetables of all agents private. We report our preliminary experimental result on distributed university timetabling problems (DisUTTPs). Multiagent system, Multiply Sectioned Constraint Networks, Distributed Constraint Satisfaction, Distributed University Timetabling.
منابع مشابه
Distributed constraint satisfaction with multiply sectioned constraint networks
We propose a new algorithmic framework, multiply sectioned constraint networks (MSCNs), for solving distributed constraint satisfaction problems (DisCSPs) with complex local problems. An MSCN is converted into a linked junction forest (LJF) and is solved by a complete algorithm. Its time complexity is linear on the number and size of local problems (each in charge by an agent) and is exponentia...
متن کاملMultiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Most existing algorithms for DCSPs are extensions of centralized backtracking or iterative improvement with breakout. Their worst case complexity is exponential. On the other hand, directional consistency based algorithms solve c...
متن کاملSome Practical Issues in Modeling Diagnostic Systems with Multiply Sectioned Bayesian Networks
Multiply Sectioned Bayesian Networks (MSBNs) provide a distributed framework for diagnosis of large systems based on probabilistic knowledge. To ensure exact inference, the partition of a large system into subsystems and the representation of subsystems must follow a set of technical constraints. How to satisfy these goals for a given system may not be obvious to a practitioner. In this paper, ...
متن کاملDistributed Structure Verification in Multiply Sectioned Bayesian Networks
Multiply sectioned Bayesian networks (MSBNs) provide a framework for probabilistic reasoning in a single user oriented system in a large problem domain or in a cooperative multi-agent distributed interpretation system. During the construction or dynamic formation of a MSBN, an automatic verification of the acyclicity of the overall structure is desired. Although algorithms for testing acyclicit...
متن کاملInference in Multiply Sectioned Bayesian
As Bayesian networks are applied to larger and more complex problem domains, search for exible modeling and more eecient inference methods is an ongoing eeort. Multiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for exible modeling and distributed inference. Lazy propagation extends the Shafer-Shenoy and HUGIN inference methods...
متن کامل